Finite prime distance graphs and 2-odd graphs
نویسندگان
چکیده
منابع مشابه
Finite prime distance graphs and 2-odd graphs
A graph G is a prime distance graph (respectively, a 2-odd graph) if its vertices can be labeled with distinct integers such that for any two adjacent vertices, the difference of their labels is prime (either 2 or odd). We prove that trees, cycles, and bipartite graphs are prime distance graphs, and that Dutch windmill graphs and paper mill graphs are prime distance graphs if and only if the Tw...
متن کاملSkolem Odd Difference Mean Graphs
In this paper we define a new labeling called skolem odd difference mean labeling and investigate skolem odd difference meanness of some standard graphs. Let G = (V,E) be a graph with p vertices and q edges. G is said be skolem odd difference mean if there exists a function f : V (G) → {0, 1, 2, 3, . . . , p + 3q − 3} satisfying f is 1−1 and the induced map f : E(G) → {1, 3, 5, . . . , 2q−1} de...
متن کاملA distance measure for large graphs based on prime graphs
Graphs are universal modeling tools. They are used to represent objects and their relationships in almost all domains: they are used to represent DNA, images, videos, social networks, XML documents, etc. When objects are represented by graphs, the problem of their comparison is a problem of comparing graphs. Comparing objects is a key task in our daily life. It is the core of a search engine, t...
متن کاملTaut Distance-Regular Graphs of Odd Diameter
Let denote a bipartite distance-regular graph with diameter D ≥ 4, valency k ≥ 3, and distinct eigenvalues θ0 > θ1 > · · · > θD . Let M denote the Bose-Mesner algebra of . For 0 ≤ i ≤ D, let Ei denote the primitive idempotent of M associated with θi . We refer to E0 and ED as the trivial idempotents of M . Let E, F denote primitive idempotents of M . We say the pair E, F is taut whenever (i) E,...
متن کاملRemarks on Distance-Balanced Graphs
Distance-balanced graphs are introduced as graphs in which every edge uv has the following property: the number of vertices closer to u than to v is equal to the number of vertices closer to v than to u. Basic properties of these graphs are obtained. In this paper, we study the conditions under which some graph operations produce a distance-balanced graph.
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Discrete Mathematics
سال: 2013
ISSN: 0012-365X
DOI: 10.1016/j.disc.2013.06.005